Minimax Algorithm
•The heuristics are used to speed up the search strategy and the Minimax algorithm is one such
strategy used by combinatorial search.
•When two players are playing against each other, they are basically working towards opposite
goals. So each side needs to predict what the opposing player is going to do in order to win the
game. Keeping this in mind, Minimax tries to achieve this through strategy.
•It will try to minimize the function that the opponent is trying to maximize.
•Minimax algorithm is a recursive or backtracking algorithm which is used in decision-making and
game theory. It provides an optimal move for the player assuming that opponent is also playing
optimally.
•MinMax algorithm is mostly used for game playing in AI. Such as Chess, Checkers, tic-tac-toe, go,
and various tow-players game. This Algorithm computes the minimax decision for the current
state.
•In this algorithm two players play the game, one is called MAX and other is called MIN. where
MAX will select the maximized value and MIN will select the minimized value.